A Hybrid Algorithm for Two-dimensional and Three-stage Exact Packing Optimization Problem

Abstract In this paper, we study the packing optimization problem of square plates under conditions that cutting mode is guillotine cut, number stages cannot exceed 3, and order sequence not considered. Because it difficult to determine constraint in process stacking items into stacks, divide nonlinear integer programming model two establish: one stage stacks followed by splicing them stripes, other forming stripes. Finally, a algorithm proposed solve problem, which combines an improved bottom-up left-justified (BL algorithm), greedy algorithm, iterative sequential value correction (ISVC algorithm) with genetic (GA) as core. Using data after preprocessing, average plate utilization rate can reach 89.29%, 10.42% more than final without any processing.